Simulation and reversal of n-qubit Hamiltonians using Hadamard matrices
نویسنده
چکیده
The ability to simulate one Hamiltonian with another is an important primitive in quantum information processing. In this paper, a simulation method based on Hadamard matrices and applicable for arbitrary σz ⊗ σz interaction (quantph/9904100) is generalized for any pairwise interaction. We describe two applications of the generalized framework. First, we obtain a class of protocols for selecting an arbitrary interaction term in an n-qubit Hamiltonian, a special case of which is given in quant-ph/0106064v2. Second, we obtain a class of protocols for inverting an arbitrary, possibly unknown n-qubit Hamiltonian, generalizing the result in quant-ph/0106085v1.
منابع مشابه
nt - p h / 03 09 06 0 v 2 2 9 N ov 2 00 3 Improving Gate - Level Simulation of Quantum Circuits ∗
Simulating quantum computation on a classical computer is a difficult problem. The matrices representing quantum gates, and the vectors modeling qubit states grow exponentially with an increase in the number of qubits. However, by using a novel data structure called the Quantum Information Decision Diagram (QuIDD) that exploits the structure of quantum operators, a useful subset of operator mat...
متن کاملSimulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds
We address the problem of simulating pair-interaction Hamiltonians in n node quantum networks where the subsystems have arbitrary, possibly different, dimensions. We show that any pair-interaction can be used to simulate any other by applying sequences of appropriate local control sequences. Efficient schemes for decoupling and time reversal can be constructed from orthogonal arrays. Conditions...
متن کاملOn simulation of Hamiltonians using local unitary transformations
We give necessary conditions for the simulation of both bipartite and multipartite Hamiltonians, which are independent of the eigenvalues of Hamiltonians and based on the algebraic-geometric invariants recently introduced in [1] [2]. The results show that the problem of simulation of Hamiltonians in arbitrary bipartite or multipartite quantum systems cannot be described by only using eigenvalue...
متن کاملOn simulation of Hamiltonians using local unitary transforamtions
We give a necessary condition for the simulation of Hamiltonians, which is independent of the eigenvalues of Hamiltonians and based on the algebraic-geometric invariants recently introduced in [1] [2]. The result shows that the problem of simulation of Hamiltonians in arbitrary bipartite quantum systems cannot be described by only using eigenvalues, which is quite different to the two-qubit cas...
متن کاملSimulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity
We use an n-spin system with permutation symmetric zz-interaction for simulating arbitrary pair-interaction Hamiltonians. The calculation of the required time overhead is mathematically equivalent to a separability problem of n-qubit density matrices. We derive lower and upper bounds in terms of chromatic index and the spectrum of the interaction graph. The complexity measure defined by such a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002